Repeated Games with Incomplete Information on One Side: The Case of Different Discount Factors
نویسندگان
چکیده
Two players engage in a repeated game with incomplete information on one side, where the underlying stage-games are zero-sum. In the case where players evaluate their stage-payoffs by using different discount factors, the payoffs of the infinitely repeated game are typically non zero-sum. However, if players grow infinitely patient, then the equilibrium payoffs will sometimes approach the zero-sum result, depending on the asymptotic relative patience of the players. We provide sufficient conditions that ensure a zero-sum limit. Moreover, we provide examples of games violating these conditions that possess “cooperative” equilibria whose payoffs are bounded away from the zero-sum payoffs set.
منابع مشابه
Some Asymptotic Results in Discounted Repeated Games of One-Sided Incomplete Information
The paper analyzes the Nash equilibria of two-person discounted repeated games with one-sided incomplete information and known own payoffs. If the informed player is arbitrarily patient, relative to the uninformed player, then the characterization for the informed player’s payoffs is essentially the same as that in the undiscounted case. This implies that even small amounts of incomplete inform...
متن کاملThe Folk Theorem in Repeated Games of Incomplete Information
The paper analyzes the Nash equilibria of two-person discounted repeated games with one-sided incomplete information. If the informed player is arbitrarily patient relative to the uninformed player, then the characterization is essentially the same as that in the undiscounted case. This implies that even small amounts of incomplete information can lead to a dis-continuous change in the equilibr...
متن کاملCooperation under Incomplete Information on the Discount Factors
In the repeated Prisoner’s Dilemma, when every player has a different discount factor, the grim-trigger strategy is an equilibrium if and only if the discount factor of each player is higher than some threshold. What happens if the players have incomplete information regarding the discount factors? In this work we look at repeated games in which each player has incomplete information regarding ...
متن کاملExistence of optimal strategies in Markov games with incomplete information
The existence of a value and optimal strategies is proved for the class of twoperson repeated games where the state follows a Markov chain independently of players’ actions and at the beginning of each stage only player one is informed about the state. The results apply to the case of standard signaling where players’ stage actions are observable, as well as to the model with general signals pr...
متن کاملRenegotiation-Proof Relational Contracts with Side Payments
We study infinitely repeated two player games with perfect information, where each period consists of two stages: one in which the parties simultaneously choose an action and one in which they can transfer money to each other. We first derive simple conditions that allow a constructive characterization of all Paretooptimal subgame perfect payoffs for all discount factors. Afterwards, we examine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Oper. Res.
دوره 24 شماره
صفحات -
تاریخ انتشار 1999